Several Kinds of Chromatic Numbers of Multi-fan Graphs
نویسندگان
چکیده
منابع مشابه
Braodcast Chromatic Numbers of Graphs
A function π : V → {1, . . . , k} is a broadcast coloring of order k if π(u) = π(v) implies that the distance between u and v is more than π(u). The minimum order of a broadcast coloring is called the broadcast chromatic number of G, and is denoted χb(G). In this paper we introduce this coloring and study its properties. In particular, we explore the relationship with the vertex cover and chrom...
متن کاملchromatic and clique numbers of a class of perfect graphs
let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.
متن کاملGraphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly 1 2=k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring an...
متن کاملChromatic Numbers in Some Graphs
Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f : V (G) → T , where | T |= k and it is proper if the adjacent vertices have different labels. A graph is k-colorable if it has a proper k-coloring. The chromatic number χ(G) is the least k such that G is k-colorable. Here we study chromatic numbers in some kinds of Harary graphs. Mathematics Subject Classification: 05C15
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Mathematics
سال: 2016
ISSN: 2328-5605
DOI: 10.11648/j.acm.20160503.16